| 1. | A new branch and bound algorithm for solving complex integer quadratic programs
解复杂二次整数规划问题的新型分枝定界算法 |
| 2. | Branch and bound algorithm
分枝界定法 |
| 3. | A branch and bound algorithm for solving maximizing a concave function over weakly - efficient
弱有效集上凹函数极大问题的分枝定界算法 |
| 4. | Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解优化问题的重要方法。 |
| 5. | 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
计算表明,在保证求得最优解的前提下,该平台能很好地提高分支定界算法的效率。 |
| 6. | This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分两部分，第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。 |
| 7. | The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。 |
| 8. | We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study
根据johnson算法和并行可替换机床优化调度算法，构造了两种可行的启发式优化调度算法，并通过数值计算，验证了算法的有效性。 |
| 9. | In this thesis , the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency
本文设计实现的一种专用于计算分支定界算法的机群计算平台,能减少分支定界算法的计算时间复杂度,提高分支定界算法的效率。 |
| 10. | A great significance of this article is that it changes the branch and bound algorithm and backtracking algorithm into application examples of the generic search algorithm of optimal problems advanced in this article
本文的一个重要意义是将回溯法和分支限界法这两个传统的算法策略转变为本文所提出的通用搜索算法的应用例子。 |
